TSTP Solution File: ANA123^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : ANA123^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 18:41:52 EDT 2024

% Result   : Theorem 0.20s 0.39s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   28 (  15 unt;  13 typ;   0 def)
%            Number of atoms       :   48 (   9 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &;   0   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   22 (  21   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   2 con; 0-6 aty)
%            Number of variables   :   14 (   3   ^   3   !;   0   ?;  14   :)
%                                         (   8  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(type_def_6,type,
    'type/realax/real': $tType ).

thf(func_def_0,type,
    'type/realax/real': $tType ).

thf(func_def_1,type,
    'const/trivia/I': 
      !>[X0: $tType] : ( X0 > X0 ) ).

thf(func_def_2,type,
    'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).

thf(func_def_6,type,
    iCOMB: 
      !>[X0: $tType] : ( X0 > X0 ) ).

thf(func_def_7,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_8,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_9,type,
    vAND: $o > $o > $o ).

thf(func_def_10,type,
    vOR: $o > $o > $o ).

thf(func_def_11,type,
    vIMP: $o > $o > $o ).

thf(func_def_12,type,
    vNOT: $o > $o ).

thf(func_def_13,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f17,plain,
    $false,
    inference(subsumption_resolution,[],[f16,f13]) ).

thf(f13,plain,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')) != $true,
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')) != $true,
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')) != $true,
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ~ vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')),
    inference(rectify,[],[f4]) ).

thf(f4,negated_conjecture,
    ~ vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_I_') ).

thf(f16,plain,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function','const/trivia/I'('type/realax/real')) = $true,
    inference(forward_demodulation,[],[f15,f14]) ).

thf(f14,plain,
    ! [X0: $tType] : ( 'const/trivia/I'(X0) = iCOMB ),
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    ! [X0: $tType] : ( 'const/trivia/I'(X0) = iCOMB ),
    inference(fool_elimination,[],[f2]) ).

thf(f2,axiom,
    ! [X0: $tType] :
      ( 'const/trivia/I'(X0)
      = ( ^ [X1: X0] : X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/trivia/I_DEF_') ).

thf(f15,plain,
    $true = vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function',iCOMB),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    $true = vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function',iCOMB),
    inference(fool_elimination,[],[f10]) ).

thf(f10,plain,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function',
      ^ [X0: 'type/realax/real'] : X0),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    vAPP(sTfun('type/realax/real','type/realax/real'),$o,'const/iterate/polynomial_function',
      ^ [X0: 'type/realax/real'] : X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_ID_') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem    : ANA123^1 : TPTP v8.2.0. Released v7.0.0.
% 0.14/0.16  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.37  % Computer : n028.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Mon May 20 07:50:23 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.14/0.37  % (13082)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.38  % (13085)WARNING: value z3 for option sas not known
% 0.20/0.39  % (13084)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.39  % (13089)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.20/0.39  % (13088)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.20/0.39  % (13087)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.39  % (13085)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.39  % (13090)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.20/0.39  % Exception at run slice level
% 0.20/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39  % Exception at run slice level
% 0.20/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39  % (13090)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.39  % (13090)First to succeed.
% 0.20/0.39  % (13089)Also succeeded, but the first one will report.
% 0.20/0.39  % (13088)Also succeeded, but the first one will report.
% 0.20/0.39  % (13090)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13082"
% 0.20/0.39  % (13085)Also succeeded, but the first one will report.
% 0.20/0.39  % (13090)Refutation found. Thanks to Tanya!
% 0.20/0.39  % SZS status Theorem for theBenchmark
% 0.20/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39  % (13090)------------------------------
% 0.20/0.39  % (13090)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.39  % (13090)Termination reason: Refutation
% 0.20/0.39  
% 0.20/0.39  % (13090)Memory used [KB]: 749
% 0.20/0.39  % (13090)Time elapsed: 0.002 s
% 0.20/0.39  % (13090)Instructions burned: 3 (million)
% 0.20/0.39  % (13082)Success in time 0.017 s
%------------------------------------------------------------------------------